Display Calculi for Nominal Tense Logics
نویسندگان
چکیده
منابع مشابه
Display Calculi for Nominal Tense Logics
We define display calculi for nominal tense logics extending the minimal nominal tense logic ( ) by addition of primitive axioms. To do so, we use the natural translation of into the minimal tense logic of inequality ( ) which is known to be properly displayable by application of Kracht’s results. The rules of the display calculus Æ for mimic those of the display calculus Æ for . We show that e...
متن کاملCut - free Display Calculi for Nominal Tense
We deene cut-free display calculi for nominal tense logics extending the minimal nominal tense logic (MNTL) by addition of primitive axioms. To do so, we use a translation of MNTL into the minimal tense logic of inequality (MTL6 =) which is known to be properly displayable by application of Kracht's results. The rules of the display calculus MNTL for MNTL mimic those of the display calculus MTL...
متن کاملSequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?
We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π 1 -formulae and Π 0 2 -formulae. The calculi are based on d’Agostino and Mondadori’s calculus KE and therefore they admit a restricted cutrule that is not eliminable. A nice computational property of the restriction is, for instance, that at any stage of ...
متن کاملOn the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents. Our first style of calculi is what we call “shallow calculi”, where inference rules are only applied at the root node in a nested sequent. Our shallow calculi are extensions of Kashima’s calculus for...
متن کاملMultiple-Labelled Transition Systems for nominal calculi and their logics
Action Labelled transition systems (LTS) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper, we introduce Multiple Labelled Transition Systems (MLTS) as generalizations of LTS that permit also dealing with systems features that are becoming more and more important when considering languages and models for network aware programming. M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2002
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/12.6.993